Lidstone Fractal Interpolation and Error Analysis

In the present paper, the notion of Lidstone Fractal Interpolation Function ($Lidstone \ FIF$) is introduced to interpolate and approximate data generating functions that arise from real life objects and outcomes of several scientific experiments. A Lidstone FIF extends the classical Lidstone Interpolation Function which is generally found not to be satisfactory in interpolation and approximation of such functions. For a data $\{(x_n,y_{n,2k}); n=0,1,\ldots,N \ \text{and} \ k=0,1,\ldots,p\}$with$N,p\in\mathbb{N}$, the existence of Lidstone FIF is proved in the present work and a computational method for its construction is developed. The constructed Lidstone FIF is a$C^{2p}[x_0,x_N]$fractal function$\ell_\alpha$satisfying$\ell_\alpha^{(2k)}(x_n)=y_{n,2k}$,$n=0,1,\ldots,N$,\$k=0,1,\ldots,p$. Our error estimates establish that the order of$L^\infty$-error in approximation of a data generating function in$C^{2p}[x_0,x_N]$by Lidstone FIF is of the order$N^{-2p}$, while$L^\infty$-error in approximation of$2k$-order derivative of the data generating function by corresponding order derivative of Lidstone FIF is of the order$N^{-(2p-2k)}$. The results found in the present work are illustrated for computational constructions of a Lidstone FIF and its derivatives with an example of a data generating function.Comment: 20 pages, 3 figure

Subsiding routing misbehavior in MANET using "Mirror Model"

Noncooperation or failure to work together is a big challenge that surely degrades the performance and reliability of Mobile Adhoc Networks. In MANETs, nodes have dual responsibilities of forwarding and routing, that's why it needs unison with nodes. To sort out non-cooperation a real life behavior should be implemented, so that misbehavior is nullified. In this paper, we present the "Mirror Model" that strictly enforces cooperation due to its punishment strategy. Node's behavior is watched by its neighbors in PON mode, to update the NPF, NPRF values for a threshold time. After the expiry of the threshold time each node calculates the PFR and broadcasts its neighbors. Similarly all neighbors broadcasted PFR is received and processed by the node to define the 'G' and 'BP' values. The G value is used to isolate selfish nodes from the routing paths and BP denotes the amount of packets to be dropped by an honest node against a selfish node in spite of its misbehavior/packet drops. Cooperation within the neighbors, certainly result in subsiding misbehavior of selfish nodes, therein enhancing cooperation of the whole MANET. This model ensures honesty and reliability in MANET because it does not eliminate a node, but it behaves in the same way as the node behaved. Therefore, it justifies its name, after all mirrors reflects the same. We have implemented the model in "GloMoSim" on top of the DSR protocol, resulting its effectiveness, as compared to the DSR protocol when the network is misconducting for its selfish needs.Comment: 15 pages, 4 figures, 3 tables. arXiv admin note: substantial text overlap with arXiv:1309.220

The principles of humanism for MANETs

The proposed humanistic approach mapped the human character and behavior into a device to evade the bondages of implementation and surely succeed as we live. Human societies are the complex and most organized networks, in which many communities having different cultural livelihood. The formation of communities within a society and the way of associations can be mapped to MANET. In this work we have presented the principles of humanism for MANETs. The proposed approach is not only robust and secure but it certainly meets the existing challenges (such as name resolution, address allocation and authentication). Its object oriented design defines a service in terms of Arts, Culture, and Machine. An 'Art' is the smallest unit of work (defined as an interface), the 'Culture' is the integration and implementation of one or more Arts (defined as a class) and finally the 'Machine' which is an instance of a Culture that defines a running service. The grouping of all communicable Machines having the same Culture forms a 'Community'. We have used the term 'Society' for a MANET having one or more communities and modeled using the humanistic approach. The proposed approach is compared with GloMoSim and the implementation of file transfer service is presented using the said approach. Our approach is better in terms of implementation of the basic services, security, reliability, throughput, extensibility, scalability etc.Comment: 14 pages, 7 figures, 10 table

Securing Software as a Service Model of Cloud Computing: Issues and Solutions

Cloud computing, undoubtedly, has become the buzzword in the IT industry today. Looking at the potential impact it has on numerous business applications as well as in our everyday life, it can certainly be said that this disruptive technology is here to stay. Many of the features that make cloud computing attractive, have not just challenged the existing security system, but have also revealed new security issues. This paper provides an insightful analysis of the existing status on cloud computing security issues based on a detailed survey carried by the author. It also makes an attempt to describe the security challenges in Software as a Service (SaaS) model of cloud computing and also endeavors to provide future security research directions

Recombination of low energy electrons with U28+^{28+}

We performed an extensive study of configuration mixing between the doubly excited (doorway) states and complex multiply excited states of U$^{28+}$ near its ionization threshold. The detailed investigation of complex spectrum and analysis of the statistics of eigenstate components show that the dielectronic (doorway) states weakly mixed with each other. However, they show substantial mixing with the complex multiply excited states. This situation explains the mechanism of low energy electron recombination with U$^{28+}$. We calculated the energy averaged capture cross sections as a sum over dielectronic doorway states and found our present calculation interprets well the experimental recombination rates in the energy range of 1 to 100 eV.Comment: 19 pages, 11 figure

Towards Securing APIs in Cloud Computing

Every organisation today wants to adopt cloud computing paradigm and leverage its various advantages. Today everyone is aware of its characteristics which have made it so popular and how it can help the organisations focus on their core activities leaving all IT services development and maintenance to the cloud service providers. Application Programming Interfaces (APIs) act as the interface between the CSPs and the consumers. This paper proposes an improved access control mechanism for securing the Cloud APIs.Comment: International Journal of Computer Engineering and Applications, June 2013. arXiv admin note: text overlap with arXiv:0901.0131 by other author

On testing violations of Bose and CPTCPT symmetries via Dalitz plots and Dalitz `prism'

Bose symmetry and $CPT$ symmetry are two very fundamental symmetries of Nature. However, the validity of these symmetries in diverse phenomena must be verified by experiments. We propose new techniques to probe these two fundamental symmetries in the realm of mesons by using the Dalitz plot of a few three-body meson decays. Since these symmetries are very fundamental in nature, their violations, if any, are expected to be extremely small. Hence observing their violations requires study of a huge data sample. In this context we introduce a new three-dimensional plot which we refer to as the Dalitz 'prism'. This provides an innovative means for acquiring the huge statistics required for such studies. Using the Dalitz plots and the Dalitz prisms we chart out the way to probe the violations of Bose and $CPT$ symmetries in a significant manner. Since mesons are unstable and composite particles, testing the validity of Bose symmetry and the $CPT$ symmetry in these cases are of paramount importance for fundamental physics.Comment: 5 pages, 2 figures; previous version was not the latest draft, had many references missin

A Probabilistic Model For Sequence Analysis

This paper presents a probabilistic approach for DNA sequence analysis. A DNA sequence consists of an arrangement of the four nucleotides A, C, T and G and different representation schemes are presented according to a probability measure associated with them. There are different ways that probability can be associated with the DNA sequence: one way is when the probability of an occurrence of a letter does not depend on the previous one (termed as unsuccessive probability) and in another scheme the probability of occurrence of a letter depends on its previous letter (termed as successive probability). Further, based on these probability measures graphical representations of the schemes are also presented. Using the diagram probability measure one can easily calculate an associated probability measure which can serve as a parameter to check how close is a new sequence to already existing ones.Comment: IEEE format, International Journal of Computer Science and Information Security, IJCSIS January 2010, ISSN 1947 5500, http://sites.google.com/site/ijcsis

Algorithm for Predicting Protein Secondary Structure

Predicting protein structure from amino acid sequence is one of the most important unsolved problems of molecular biology and biophysics.Not only would a successful prediction algorithm be a tremendous advance in the understanding of the biochemical mechanisms of proteins, but, since such an algorithm could conceivably be used to design proteins to carry out specific functions.Prediction of the secondary structure of a protein (alpha-helix, beta-sheet, coil) is an important step towards elucidating its three dimensional structure as well as its function. In this research, we use different Hidden Markov models for protein secondary structure prediction. In this paper we have proposed an algorithm for predicting protein secondary structure. We have used Hidden Markov model with sliding window for secondary structure prediction.The secondary structure has three regular forms, for each secondary structural element we are using one Hidden Markov Model.Comment: Submitted to Journal of Computer Science and Engineering, see http://sites.google.com/site/jcseuk/volume-1-issue-1-may-201

Nontransitive Ranking to Enhance Routing Decision in MANETS

An ad hoc network is an infrastructureless network in which nodes perform terminal as well as routing functions. A routing protocol is the only substitute to complete the communications in the absence of an access point. In spite of that mobile nodes or so called routers uses some mechanism for calculating the best route when it has multiple routes for the same destination. On the basis of one or more metrics routes are ranked from best to worst. But, in an ad hoc network many factors can affect this decision, such as the delay, load, route lifetime etc. Thus measuring and finding routes on the basis of crisp mathematical model for all these attributes is complicated. That why, the fuzzy approach for best route determination is required for MANET because some of the metrics are fuzzy or vague and the classical ranking of routes and transitivity in the ranking does not hold. The proposed Nontransitive Route Ranking subjective comparison of one route with others and performs nontransitive ranking to rank routes from best to worst. The pairwise comparisons of each route with others give more accurate and fair comparison. The proposed ranking is easier than classical ranking in which metrics have assigned some value and these values are combined to obtain the ranking. Experimental result shows the efficiency of the proposed model. Keywords: Fuzzy, Rank, Nontransitive, Route, Ranking, RelativityComment: 7 Pages, IJCEA 201